package 力扣日常刷题.木22二月.第19天225;

/**
 * @author 帅小伙
 * @date 2022/2/25
 * @description
 */
public class Demo153搜索旋转排序数组 {


    public int search(int[] nums, int target) {
        int n = nums.length;
        if (n == 0) return -1;
        if (n == 1) return nums[0] == target ? 0 : -1;
        int l = 0, r = n - 1;
        while (l <= r) {
            int mid = (l + r) / 2;
            if (nums[mid] == target) return mid;
            if (nums[0] <= nums[mid]) {
                if (target < nums[mid]&&nums[0] <= target) {
                    r = mid - 1;
                } else {
                    l = mid + 1;
                }
            } else {
                if(nums[mid] < target && target <= nums[n - 1]){
                    l = mid + 1;
                }else {
                    r = mid  - 1;
                }
            }
        }
        return -1;
    }
}
